1391A - Suborrays - CodeForces Solution

constructive algorithms math *800

Please click on ads to support us..

Python Code: 

for i in range(int(input())):

    n = int(input())
    l = []
    for j in range(n):
        l.append(j+1)

    print(*l)

C++ Code: 

#include<bits/stdc++.h>
using namespace std;
#define ll long long int

int main(){
    ll tt;
    cin>>tt;
    while(tt--){
        ll n;
        cin>>n;
        while(n>0){
            cout<<n<<" ";
            n--;
        }
        cout<<endl;


    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

1038B - Non-Coprime Partition
43A - Football
50A - Domino piling
479A - Expression
1480A - Yet Another String Game
1216C - White Sheet
1648A - Weird Sum
427A - Police Recruits
535A - Tavas and Nafas
581A - Vasya the Hipster
1537B - Bad Boy
1406B - Maximum Product
507B - Amr and Pins
379A - New Year Candles
1154A - Restoring Three Numbers
750A - New Year and Hurry
705A - Hulk
492B - Vanya and Lanterns
1374C - Move Brackets
1476A - K-divisible Sum
1333A - Little Artem
432D - Prefixes and Suffixes
486A - Calculating Function
1373B - 01 Game
1187A - Stickers and Toys
313B - Ilya and Queries
579A - Raising Bacteria
723A - The New Year Meeting Friends
302A - Eugeny and Array
1638B - Odd Swap Sort